An algorithm for mixing matrix estimation in instantaneous blind source separation

Sparsity of signals in the frequency domain is widely used for blind source separation (BSS) when the number of sources is more than the number of mixtures (underdetermined BSS). In this paper we propose a simple algorithm for detection of points in the time–frequency (TF) plane of the instantaneous mixtures where only single source contributions occur. Samples at these points in the TF plane can be used for the mixing matrix estimation. The proposed algorithm identifies the single-source-points (SSPs) by comparing the absolute directions of the real and imaginary parts of the Fourier transform coefficient vectors of the mixed signals. Finally, the SSPs so obtained are clustered using the hierarchical clustering algorithm for the estimation of the mixing matrix. The proposed idea for the SSP identification is simpler than the previously reported algorithms. & 2009 Published by Elsevier B.V.